Rademacher-Type Formulas for Restricted Partition and Overpartition Functions
نویسندگان
چکیده
A collection of Hardy-Ramanujan-Rademacher type formulas for restricted partition and overpartition functions is presented, framed by several biographical anecdotes.
منابع مشابه
A Theorem on Seven-colored Overpartitions and Its Applications
A q-series identity in four parameters is established and interpreted it as a statement about 7-colored overpartitions. As corollaries some overpartition theorems of the RogersRamanujan type and some weighted overpartition theorems are exhibited. Among these are overpartition analogues of classical partition theorems of Schur and Göllnitz.
متن کاملRank and Congruences for Overpartition Pairs
The rank of an overpartition pair is a generalization of Dyson’s rank of a partition. The purpose of this paper is to investigate the role that this statistic plays in the congruence properties of pp(n), the number of overpartition pairs of n. Some generating functions and identities involving this rank are also presented.
متن کاملTowards an automation of the circle method
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are pr...
متن کاملOverpartition Theorems of the Rogers-ramanujan Type
We give one-parameter overpartition-theoretic analogues of two classical families of partition identities: Andrews’ combinatorial generalization of the Gollnitz-Gordon identities and a theorem of Andrews and Santos on partitions with attached odd parts. We also discuss geometric counterparts arising from multiple q-series identities. These involve representations of overpartitions in terms of g...
متن کاملCongruences for Hyper M-ary Overpartition Functions
We discuss a new restricted m-ary overpartition function hm(n), which is the number of hyper m-ary overpartitions of n, such that each power of m is allowed to be used at most m times as a non-overlined part. In this note we use generating function dissections to prove the following family of congruences for all n ≥ 0, m ≥ 4, j ≥ 0, 3 ≤ k ≤ m− 1, and t ≥ 1: hm(mn + mj+t−1k + · · · + mk) ≡ 0(mod...
متن کامل